Erdős-Szekeres Theorem for Point Sets with Forbidden Subconfigurations

نویسندگان

  • Gyula Károlyi
  • Géza Tóth
چکیده

According to the Erdős-Szekeres theorem, every set of n points in the plane contains roughly logn in convex position. We investigate how this bound changes if our point set does not contain a subset that belongs to a fixed order type.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Erdős–szekeres Theorem with Forbidden Order Types. Ii

According to the Erdős-Szekeres theorem, every set of n points in the plane contains roughly logn in convex position. We investigate how this bound changes if our point set does not contain a subset that belongs to a fixed order type.

متن کامل

On k-convex polygons

We introduce a notion of k-convexity and explore polygons in the plane that have this property. Polygons which are k-convex can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard problem. We give a characterization of 2-convex polygons, a particularly interesting class, and show how to recognize them in O(n log n) time. A description of their sh...

متن کامل

Erdos-Szekeres theorem with forbidden order types

According to the classical Erdős–Szekeres theorem, every sufficiently large set of points in general position in the plane contains a large subset in convex position. Parallel to the Erdős–Hajnal problem in graph-Ramsey theory, we investigate how large such subsets must a configuration contain if it does not have any sub-configuration belonging to a fixed order type. © 2005 Elsevier Inc. All ri...

متن کامل

Happy Endings of noncrossing convex bodies . joint work with :

We introduce a combinatorial invariant of arrangements of compact convex sets in the plane, generalizing the notion of the order type of planar point sets. This allows us to define and study realization spaces, extending previous work on representability and isotopy by Levi, Ringel, Folkman and Lawrence, Goodman and Pollack, and Mnëv. With these tools at hand we attack the generalized Erdős-Sze...

متن کامل

Order Types of Convex Bodies

We prove a Hadwiger transversal type result, characterizing convex position on a family of non-crossing convex bodies in the plane. This theorem suggests a definition for the order type of a family of convex bodies, generalizing the usual definition of order type for point sets. This order type turns out to be an oriented matroid. We also give new upper bounds on the Erdős-Szekeres theorem in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2012